Taming Implications in Dummett Logic
نویسنده
چکیده
This paper discusses a new strategy to decide Dummett logic. The strategy relies on a tableau calculus whose distinguishing features are the rules for implicative formulas. The strategy has been implemented and the experimental results are reported.
منابع مشابه
From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games
Building on a version of Lorenzen’s dialogue foundation for intuitionistic logic, we show that Gödel-Dummett logic G can be characterized by a suitable game of communicating parallel dialogues. This provides a computational interpretation of Avron’s hypersequent calculus for G.
متن کاملTableau Calculus for Dummett Logic Based on Present and Next State of Knowledge
In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of non-invertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which...
متن کاملA Hypersequent System for Gödel-Dummett Logic with Non-constant Domains
Gödel-Dummett logic is an extension of first-order intuitionistic logic with the linearity axiom (A ⊃ B)∨ (B ⊃ A), and the so-called “quantifier shift” axiom ∀x(A ∨ B(x)) ⊃ A ∨ ∀xB(x). Semantically, it can be characterised as a logic for linear Kripke frames with constant domains. Gödel-Dummett logic has a natural formalisation in hypersequent calculus. However, if one drops the quantifier shif...
متن کاملFast Decision Procedure for Propositional Dummett Logic Based on a Multiple Premise Tableau Calculus
We present a procedure to decide propositional Dummett logic. This procedure relies on a tableau calculus with a multiple premise rule and optimizations. The resulting implementation outperforms the state of the art graph-based procedure.
متن کاملRefutation in Dummett Logic Using a Sign to Express the Truth at the Next Possible World
In this paper we use the Kripke semantics characterization of Dummett logic to introduce a new way of handling non-forced formulas in tableau proof systems. We pursue the aim of reducing the search space by strictly increasing the number of forced propositional variables after the application of noninvertible rules. The focus of the paper is on a new tableau system for Dummett logic, for which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009